521A - DNA Alignment - CodeForces Solution


greedy math *1500

Please click on ads to support us..

Python Code:

MOD = 10**9 + 7

def count_maximum_vasya_distance_strings(s):
    n = len(s)
    freq = {'A': 0, 'C': 0, 'G': 0, 'T': 0}
    for char in s:
        freq[char] += 1
    
        max_freq = max(freq.values())
    max_chars = [ch for ch, f in freq.items() if f == max_freq]
    
        pow_func = lambda x, y: pow(x, y, MOD)      count = pow_func(len(max_chars), n)      return count

n = int(input())
s = input()

result = count_maximum_vasya_distance_strings(s)
print(result)


Comments

Submit
0 Comments
More Questions

987A - Infinity Gauntlet
1676G - White-Black Balanced Subtrees
1716D - Chip Move
1352F - Binary String Reconstruction
1487B - Cat Cycle
1679C - Rooks Defenders
56A - Bar
1694B - Paranoid String
35A - Shell Game
1684A - Digit Minimization
43B - Letter
1017A - The Rank
1698B - Rising Sand
235A - LCM Challenge
1075B - Taxi drivers and Lyft
1562A - The Miracle and the Sleeper
1216A - Prefixes
1490C - Sum of Cubes
868A - Bark to Unlock
873B - Balanced Substring
1401D - Maximum Distributed Tree
1716C - Robot in a Hallway
1688B - Patchouli's Magical Talisman
99A - Help Far Away Kingdom
622B - The Time
1688C - Manipulating History
1169D - Good Triple
1675B - Make It Increasing
588A - Duff and Meat
1541B - Pleasant Pairs